Large-Scale Formal Proof for the Working Mathematician ALEXANDRIA

ثبت نشده
چکیده

Problem 11 is due to P. E. Howard.’ The results of Problems 12 and 13 were announced by Pincus. The independence result in Theorem 7.1 1 was proved by Levy [I9621 for ZFA and transferred to Z F by Pincus [ 1969,1973b1, whose is also the observation in Problem 15.’ Example 7.12 in Section 7.4 is due to Tarski. Conditions (S) and (D) were formulated by Mostowski [1945], who proved the independence result of Theorem 7.16 (for ZFA) and the sufficiency of Condition (D) (Problem 20); the result of Problem 16 is also his. The proof of the sufficiency of condition ( S ) given here is due to Szmielew [1947]. The independence result in Problem 21 was announced by Gauntt [1970]. 3 * 4 For additional results concerning the Axiom of Choice for finite sets, see the papers of Wiiniewski and Zuckerman. The results of Problems 23 and 24 are due to Morris [1969].5 The independence of the Prime Ideal Theorem from the Hahn-Banach Theorem was proved by Pincus [1972b]. The independence of the Prime Ideal Theorem from the Order Extension Principle (Problem 27) is due to Felgner [1971b].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computer Supported Mathematics with ΩMEGA

Classical automated theorem proving of today is based on ingenious search techniques to find a proof for a given theorem in very large search spaces—often in the range of several billion clauses. But in spite of many successful attempts to prove even open mathematical problems automatically, their use in everyday mathematical practice is still limited. The shift from search based methods to mor...

متن کامل

Full First-Order Free Variable Sequents and Tableaux in Implicit Induction

We show how to integrate implicit inductive theorem proving into free variable sequent and tableau calculi and compare the appropri-ateness of tableau calculi for this integration with that of sequent calculi. When rst-order validity is introduced to students it comes with some complete calculus. If this calculus happens to be an analytic calculus augmented with a Cut rule like a sequent or tab...

متن کامل

Formal Proof—The Four- Color Theorem

The Tale of a Brainteaser Francis Guthrie certainly did it, when he coined his innocent little coloring puzzle in 1852. He managed to embarrass successively his mathematician brother, his brother’s professor, Augustus de Morgan, and all of de Morgan’s visitors, who couldn’t solve it; the Royal Society, who only realized ten years later that Alfred Kempe’s 1879 solution was wrong; and the three ...

متن کامل

Deep Mathematical Results Are The Ones That Connect Seemingly Unrelated Areas: Towards A Formal Proof Of Gian-Carlo Rota's Thesis

When is a mathematical result deep? At first glance, the answer to this question is subjective: what is deep for one mathematician may not sound that deep for another. A renowned mathematician Gian-Carlo Rota expressed an opinion that the notion of deepness is more objective that we may think: namely, that a mathematical statement is deep if and only if it connects two seemingly unrelated areas...

متن کامل

Zen and the art of formalization

N. G. de Bruijn, now professor emeritus of the Eindhoven University of Technology, was a pioneer in the field of interactive theorem proving. From 1967 to the end of the 1970’s, his work on the Automath system introduced the architecture that is common to most of today’s proof assistants, and much of the basic technology. But de Bruijn was a mathematician first and foremost, as evidenced by the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016